A top down algorithm for constrained tree inclusion
نویسندگان
چکیده
منابع مشابه
A top down algorithm for constrained tree inclusion
An ordered labeled tree is a tree which nodes are labeled and in which the left-to-right order among siblings is significant. Given two ordered labeled trees P and T , the constrained tree inclusion problem is to determine whether it is possible to obtain P from T by deleting degree-one or degreetwo nodes. G. Valiente proposed a bottom up algorithm which solves the problem in O(|P ||T |) time a...
متن کاملAn Efficient Top-down Algorithm for Tree Inclusion
Let T and S be ordered, labeled trees. We say that S is included in T if there is a sequence of delete operations performed on T, which make T isomorphic to S. In this paper, we propose a top-down algorithm for this problem, which needs only O(|T|⋅|leaves(S)|) time and O(|T| + |S|) space.
متن کاملOn the top-down evaluation of tree inclusion problem
We consider the following tree-matching problem: Given labelled, ordered trees P and T, can P be obtained from T by deleting nodes. Deleting a node v entails removing all edges incident to v and, if v has a parent u, replacing the edges from u to v by edges from u to the children of v. The best known algorithm for this problem needs O(|T|·|leaves(P)|) time and O(|leaves(P)|·min{DT,·|leaves(T)|}...
متن کاملA new tree inclusion algorithm
We consider the following tree-matching problem: Given labeled, ordered trees P and T , can P be obtained from T by deleting nodes? Deleting a node v entails removing all edges incident to v and, if v has a parent u, replacing the edges from u to v by edges from u to the children of v. The existing algorithm for this problem needs O(|T || leaves(P )|) time and O(| leaves(P )|min{DT , | leaves(T...
متن کاملIntroducing Cuts into Top-down Search: A New Way to Check Tree Inclusion
The ordered tree inclusion is an interesting problem, by which we will check whether a pattern tree P can be included in a target tree T, where the order of siblings in both P and T is significant. In this paper, we propose an efficient algorithm for this problem. Its time complexity is bounded by O(|T|loghP) with O(|T| + |P|) space being used, where hP represents the height of P. Up to now th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2015
ISSN: 1570-8667
DOI: 10.1016/j.jda.2015.05.012